/*
 * Copyright (C) 2009,2010 University of Paderborn, Computer Networks Group
 * Copyright (C) 2009,2010 Christian Dannewitz <christian.dannewitz@upb.de>
 * Copyright (C) 2009,2010 Thorsten Biermann <thorsten.biermann@upb.de>
 * 
 * Copyright (C) 2009,2010 Eduard Bauer <edebauer@mail.upb.de>
 * Copyright (C) 2009,2010 Matthias Becker <matzeb@mail.upb.de>
 * Copyright (C) 2009,2010 Frederic Beister <azamir@zitmail.uni-paderborn.de>
 * Copyright (C) 2009,2010 Nadine Dertmann <ndertmann@gmx.de>
 * Copyright (C) 2009,2010 Michael Kionka <mkionka@mail.upb.de>
 * Copyright (C) 2009,2010 Mario Mohr <mmohr@mail.upb.de>
 * Copyright (C) 2009,2010 Felix Steffen <felix.steffen@gmx.de>
 * Copyright (C) 2009,2010 Sebastian Stey <sebstey@mail.upb.de>
 * Copyright (C) 2009,2010 Steffen Weber <stwe@mail.upb.de>
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the University of Paderborn nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package netinf.eventservice.siena.translation;

/**
 * Offers convenience methods for creating and modifying the names of Siena's filters that are used by
 * SubscriptionTranslatorSiena.
 * 
 * @author PG Augnet 2, University of Paderborn
 */
public class SienaFilterName {
   private String prefix;
   private StringBuilder components = new StringBuilder();

   public void setPrefix(String prefix) {
      if (!TranslationSiena.PREFIX_NEW.equals(prefix) & !TranslationSiena.PREFIX_OLD.equals(prefix)) {
         throw new IllegalArgumentException("Prefix has to be " + TranslationSiena.PREFIX_NEW + " or "
               + TranslationSiena.PREFIX_OLD + "!");
      }

      this.prefix = prefix;
   }

   public String getPrefix() {
      return this.prefix;
   }

   public void prependComponent(String component) {
      if (this.components.length() == 0) {
         this.components.append(component);
      } else {
         this.components.insert(0, component + TranslationSiena.SEPARATOR);
      }
   }

   public String getComponents() {
      return this.components.toString();
   }

   @Override
   public String toString() {
      return this.prefix + TranslationSiena.SEPARATOR + this.components;
   }

   public String toStringWithPrefix(String prefix) {
      return prefix + TranslationSiena.SEPARATOR + this.components;
   }

   public String toStringWithToggledPrefix() {
      String toggledPrefix = TranslationSiena.PREFIX_NEW.equals(this.prefix) ? TranslationSiena.PREFIX_OLD
            : TranslationSiena.PREFIX_NEW;
      return toggledPrefix + TranslationSiena.SEPARATOR + this.components;
   }
}